Rational fuzzy attribute logic
نویسنده
چکیده
We present a logic for reasoning with if-then formulas which involve constants for rational truth degrees from the unit interval. We introduce graded semantic and syntactic entailment of formulas. We prove the logic is complete in Pavelka style and depending on the choice of structure of truth degrees, the logic is a decidable fragment of the Rational Pavelka logic (RPL) or the Rational Product Logic (RΠL). We also present a characterization of the entailment based on least models and study related closure structures.
منابع مشابه
Design of a Fuzzy Controller Chip with New Structure, Supporting Rational-Powered Membership Functions
In this paper, a new structure possessing the advantages of low-power consumption, less hardware and high-speed is proposed for fuzzy controller. The maximum output delay for general fuzzy logic controllers (FLC) is about 86 ns corresponding to 11.63 MFLIPS (fuzzy logic inference per second) while this amount of the delay in the designed fuzzy controller becomes 52ns that corresponds to 19.23 M...
متن کاملOn Proofs and Rule of Multiplication in Fuzzy Attribute Logic
The paper develops fuzzy attribute logic, i.e. a logic for reasoning about formulas of the form A ⇒ B where A and B are fuzzy sets of attributes. A formula A ⇒ B represents a dependency which is true in a data table with fuzzy attributes iff each object having all attributes from A has also all attributes from B, membership degrees in A and B playing a role of thresholds. We study axiomatic sys...
متن کاملOn the relationship between fuzzy autoepistemic logic and fuzzy modal logics of belief
Autoepistemic logic is an important formalism for nonmonotonic reasoning originally intended to model an ideal rational agent reflecting upon his own beliefs. Fuzzy autoepistemic logic is a generalization of autoepistemic logic that allows to represent an agent’s rational beliefs on gradable propositions. It has recently been shown that, in the same way as autoepistemic logic generalizes answer...
متن کاملTowards Rational Closure for Fuzzy Logic: The Case of Propositional Gödel Logic
In the field of non-monotonic logics, the notion of rational closure is acknowledged as a landmark and we are going to see whether such a construction can be adopted in the context of mathematical fuzzy logic, a so far (apparently) unexplored journey. As a first step, we will characterise rational closure in the context of Propositional Gödel Logic.
متن کاملFuzzy attribute logic: syntactic entailment and completeness
Fuzzy attribute implications are particular if-then rules which can be extracted from data tables with fuzzy attributes. We develop fuzzy attribute logic (FAL), its syntax, semantics, and prove a classical as well as Pavelka-style completeness theorem for FAL. Also, we present relationships to completeness of sets of attribute implications w.r.t. data tables. Because of the limited scope of the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1502.07326 شماره
صفحات -
تاریخ انتشار 2015